A BPSK Model for Soft-Output Decoding of Binary Linear Block Codes
نویسندگان
چکیده
|It is shown that the bit LLR value in soft-output decoding of a binary linear block code with BPSK modulation can be closely modeled by a second BPSK modulation of reduced noise power. With this modeling, it is possible to provide bit error performance approximations to help in the evaluation of binary linear codes. This can also be used in the design of communications systems which require knowledge of the characteristics of the channel, such as combined source-channel coding. Simulation results are presented which show that the actual bit error performance of the code is very well approximated by this modeling, especially for low signal-to-noise ratios (SNR). Furthermore, arguments are presented which show that the approximation requires fewer samples than conventional simulation methods to obtain the same precision in the bit error probability value. This translates into fewer computations and therefore , less time is needed to obtain performance results.
منابع مشابه
Analytical Methods for the Performance Evaluation of Binary Linear Block Codes
The modeling of the soft-output decoding of a binary linear block code using a Binary Phase Shift Keying (BPSK) modulation system (with reduced noise power) is the main focus of this work. With this model, it is possible to provide bit error performance approximations to help in the evaluation of the performance of binary linear block codes. As well, the model can be used in the design of commu...
متن کاملSoft decision decoding of linear block codes based on ordered statistics in multilevel signaling
| Soft decision decoding of linear block codes based on ordered statistics is discussed in the context of multilevel coding with multistage decoding. Analytical expressions on the ordered statistics and the associated bit error probability have been derived. The result shows tradeo s between error performance and decoding complexity in multilevel signaling including BPSK modulation formats as a...
متن کاملReduced Complexity Maximum Likelihood Decoding of Linear Block Codes
This paper proposes a reduced complexity Maximum-Likelihood (ML) decoding Algorithm for Linear Block Codes based on the Kaneko decoder and incorporating ruling out conditions for useless iteration steps. The proposed decoding scheme is evaluated over the Additive White Gaussian Noise (AGWN) channel using Binary Phase Shift Key (BPSK) signalling by simulation. Simulations results show that for n...
متن کاملNear-optimum decoding of product codes: block turbo codes
This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration. This soft-input/soft-output decoder is a Chase decoder which delivers soft outputs instead of binary decisions. The soft output of the decoder is a...
متن کاملOn the Parity-Check Density and Achievable Rates of LDPC Codes for Memoryless Binary-Input Output-Symmetric Channels
We introduce upper bounds on the achievable rates of binary linear block codes under maximum-likelihood (ML) decoding, and lower bounds on the asymptotic density of their parity-check matrices; the transmission of these codes is assumed to take place over an arbitrary memoryless binary-input output-symmetric channel. The bounds hold for every sequence of binary linear block codes. The new bound...
متن کامل